Electricity production scheduling under uncertainty: Max social welfare vs. min emission vs. max renewable production
نویسندگان
چکیده
منابع مشابه
Improved Max-Min Scheduling Algorithm
In this research paper, additional constrains have been considered to progress a holistic analysis based algorithm based on Max-Min algorithm, which work on principle of sorting jobs(cloudlets) based on completion time of cloudlets. The improved algorithms here also reviews the job characteristics in method of size, pattern, payload ratio and available storage blocks in particular cluster of co...
متن کاملScheduling Arrivals for Min-max Blocking
Consider a source using a high speed data link to transmit packets to a nite capacity downstream buuer. For bursty sources using high speed links, an entire burst might be transmitted to the downstream buuer before any feedback would be received. Regulating the packet transmission process to minimize packet blocking at the downstream link is formulated as an open loop stochastic scheduling prob...
متن کاملMin-max-min Robust Combinatorial Optimization Subject to Discrete Uncertainty
We consider combinatorial optimization problems with uncertain objective functions. In the min-max-min robust optimization approach, a fixed number k of feasible solutions is computed such that the respective best of them is optimal in the worst case. The idea is to calculate a set of candidate solutions in a potentially expensive preprocessing and then select the best solution out of this set ...
متن کاملOptimization of electricity production capacity under uncertainty
The task of optimal long-term planning of electricity production capacity considering uncertainty intervals of the base, peak and intermediate loads, and multistage nature of the planning process will be tackled. Theoretical min-max approach to the problem will be given. Model uses dynamic programming and takes into account also constraints on structure of generating capacity and security of su...
متن کاملMin-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
In the classical min-max approach to robust combinatorial optimization, a single feasible solution is computed that optimizes the worst case over a given set of considered scenarios. As is well known, this approach is very conservative, leading to solutions that in the average case are far from being optimal. In this paper, we present a different approach: the objective is to compute k feasible...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Energy
سال: 2017
ISSN: 0306-2619
DOI: 10.1016/j.apenergy.2017.02.051